The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies
نویسندگان
چکیده
منابع مشابه
The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies
In the Home Care Crew Scheduling Problem a staff of caretakers has to be assigned a number of visits to patients’ homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time windows of the visits must be respected. The challenge when assigning visits to caretakers lies in ...
متن کاملTwo Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملThe crew timetabling problem: An extension of the crew scheduling problem
In some urban transportation companies driving periods are short when compared with the total duty time, leading to long non-driving periods that can be used as cover time. This paper presents the Crew Timetabling Problem, an extension of the Crew Scheduling Problem in which crew timetables are obtained by levelling the cover crew resources. An objective function for this problem is proposed in...
متن کاملProblem of Home-Care Waste Recovery at Home-Visit Nursing Stations in Japan
A questionnaire survey was conducted to investigate the problems involved in the infectious waste recovery at home-visit nursing stations. 1965 nursing stations were selected randomly, and questionnaires were sent to them. Nurses at 1314 stations (66.9%) responded to the survey and responses from 1283 stations were identified as suitable for analysis after excluding 26 stations that closed and ...
متن کاملThe Operational Flight and Multi-crew Scheduling Problem
This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties) for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2012
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.10.048